P-ACO Approach to Assignment Problem in FMSs
نویسندگان
چکیده
One of the most important problems in production planning of flexible manufacturing system (FMS) is machine tool selection and operation allocation problem that directly influences the production costs and times .In this paper minimizing machining cost, set-up cost and material handling cost as a multi-objective problem in flexible manufacturing systems environment are considered. We present a 0-1 integer linear programming model for the multiobjective machine tool selection and operation allocation problem and due to the large scale nature of the problem, solving the problem to obtain optimal solution in a reasonable time is infeasible, Paretoant colony optimization (P-ACO) approach for solving the multiobjective problem in reasonable time is developed. Experimental results indicate effectiveness of the proposed algorithm for solving the problem. Keywords—Flexible manufacturing system; Production planning; Machine tool selection; Operation allocation; Multiobjective optimization; Metaheuristic.
منابع مشابه
Analysis of the efficacy of a Two-Stage methodology for ant colony optimization: Case of study with TSP and QAP
Ant Colony Optimization (ACO) is a bioinspired metaheuristic based on ants foraging used to solve different classes of problems. In this paper, we show how, using a Two-Stage approach the quality of the solutions of ACO is improved. The Two-Stage approach can be applied to different ACO. The performance of this new approach is studied in the Traveling Salesman Problem and Quadratic Assignment P...
متن کاملA Detailed Analysis of the Population-Based Ant Colony Optimization Algorithm for the TSP and the QAP
The population-based ant colony optimization algorithm (PACO) uses a very different pheromone update when compared to other ACO algorithms. In this work, we study P-ACO’s behavior for solving the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). In particular, we investigate the impact of a local search on P-ACO parameters and performance. The results clearly show tha...
متن کاملAssignment problem and its application in Nigerian institutions: Hungarian method approach
Assignment model is a powerful operations research techniques that can be used to solve assignment or allocation problem. This study applies the assignment model to the course allocation problem in Nigeria tertiary institution in order to maximize lecturers’ effectiveness. A well-structured questionnaire was used to obtain data from lecturers and solved with Hungarian method. The study revealed...
متن کاملAn Interval Assignment Problem with Multiple Attributes: A DEA-Based Approach
One of the basic combinatorial optimization problems is the assignment problem that deals with assigning jobs to individuals. In traditional assignment problems, n jobs usually assign to n individuals such that the total cost is minimized or the total profit is maximized. However, in numerous real-life applications, various attributes could be considered in assignment problems while data (obj...
متن کاملAnt colony optimization for the cell assignment problem in PCS networks
Even though significant improvement to communications infrastructure has been attained in the personal communication service industry, the issues concerning the assignment of cells to switches in order to minimize the cabling and handoff costs in a reasonable time remain challenging and need to be solved. In this paper, we propose an algorithm based upon theAnt Colony Optimization (ACO) approac...
متن کامل